L’hypotypose dans Candide (Voltaire) : description-tableau ou description de tableau ?
نویسندگان
چکیده
منابع مشابه
Tableau Algorithms for Description Logics
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satissability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description ...
متن کاملDesigning a Tableau Reasoner for Description Logics
We present the design of a tableau reasoner, called TGC 2, that uses global caching for reasoning in description logics. We briefly describe the ExpTime tableau methods used by TGC 2. We then provide the design principles and some important optimization techniques for increasing the efficiency of the reasoner.
متن کاملA Description Logics Tableau Reasoner in Prolog
Description Logics (DLs) are gaining a widespread adoption as the popularity of the Semantic Web increases. Traditionally, reasoning algorithms for DLs have been implemented in procedural languages such as Java or C++. In this paper, we present the system TRILL for “Tableau Reasoner for descrIption Logics in proLog”. TRILL answers queries to SHOIN (D) knowledge bases using a tableau algorithm. ...
متن کاملBDD-Tableau: Combining Rich Semantic Structures with Tableau-based Search for Description Logic Reasoning
Description Logics (DLs) [1] are a family of well-understood logic-based knowledge representation frameworks. They have a wide range of applications, but are most widely known as the basis for ontology languages such as OWL. DLs are usually designed in such a way that relevant reasoning tasks (e.g. concept subsumption) are decidable. Respective reasoning algorithms have been studied, implemente...
متن کاملReasoning with Semantic Tableau Binary Trees in Description Logic
Authors of the Handbook of Description Logic present tableaux algorithms by means of a collection of so-called completion rules intended to generate a completion of ABox with respect to a corresponding TBox of a knowledge base S. An approach we present here is slightly modified. We use a set S of DL formulas of a knowledge base Σ containing DL formulas of ABox and transcriptions of definitions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Lodziensis. Folia Litteraria Romanica
سال: 2018
ISSN: 2449-8831,1505-9065
DOI: 10.18778/1505-9065.11.14